Enhanced Target Localization With Deployable Multiplatform Radar Nodes Based on Non-Convex Constrained Least Squares Optimization

نویسندگان

چکیده

A new algorithm for 3D localization in multiplatform radar networks, comprising one transmitter and multiple receivers, is proposed. To take advantage of the monostatic sensor radiation pattern features, ad-hoc constraints are imposed target process. Therefore, problem formulated as a non-convex constrained Least Squares (LS) optimization which globally solved quasi-closed-form leveraging Karush-Kuhn-Tucker (KKT) conditions. The performance assessed terms Root Mean Square Error (RMSE) comparison with benchmark Cramer Rao Lower Bound (CRLB) some competitors from open literature. results corroborate effectiveness strategy capable ensuring lower RMSE than counterpart methodologies especially low Signal to Noise Ratio (SNR) regime.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Peak-constrained least-squares optimization

We presented the basic concepts for peakconstrained least-squares (PCLS) optimization in previous papers. We present advanced PCLS optimization concepts in this paper.

متن کامل

Convex Total Least Squares

We study the total least squares (TLS) problem that generalizes least squares regression by allowing measurement errors in both dependent and independent variables. TLS is widely used in applied fields including computer vision, system identification and econometrics. The special case when all dependent and independent variables have the same level of uncorrelated Gaussian noise, known as ordin...

متن کامل

Cancer Class Discovery Using Non-negative Matrix Factorization Based on Alternating Non-negativity-Constrained Least Squares

Many bioinformatics problems deal with chemical concentrations that should be non-negative. Non-negative matrix factorization (NMF) is an approach to take advantage of non-negativity in data. We have recently developed sparse NMF algorithms via alternating nonnegativity-constrained least squares in order to obtain sparser basis vectors or sparser mixing coefficients for each sample, which lead ...

متن کامل

On the constrained mock-Chebyshev least-squares

The algebraic polynomial interpolation on uniformly distributed nodes is affected by the Runge phenomenon, also when the function to be interpolated is analytic. Among all techniques that have been proposed to defeat this phenomenon, there is the mock-Chebyshev interpolation which is an interpolation made on a subset of the given nodes which elements mimic as well as possible the Chebyshev-Loba...

متن کامل

Target localization in a multi-static passive radar system through convex optimization

We propose efficient target localization methods for a passive radar system using time-of-arrival (TOA) information of the signals received from multiple illuminators, where the position of the receiver is subject to random errors. Since the maximum likelihood (ML) formulation of this target localization problem is a non-convex optimization problem, semi-definite relaxation (SDR)-based optimiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2022.3147037